Deciding Reachability for Planar Multi-polynomial Systems
نویسندگان
چکیده
In this paper we investigate the decidability of the reach-ability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a nite number of (polyhedral) regions. To each of these regions is assigned some vector eld which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.
منابع مشابه
An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Given a graph G and two vertices s and t in it, graph reachability is the problem of checking whether there exists a path from s to t in G. We show that reachability in directed layered planar graphs can be decided in polynomial time and O(n ) space, for any > 0. The previous best known space bound for this problem with polynomial time was approximately O( √ n) space [INP13]. Deciding graph rea...
متن کاملDeciding Concurrent Planar Monotonic Linear Hybrid Systems
Decidability results for hybrid automata often exploit subtle properties about dimensionality (number of continuous variables), and interaction between discrete transitions and continuous trajectories of variables. Thus, the decidability results often do not carry over to parallel compositions of hybrid automata, even when there is no communication other than the implicit synchronization of tim...
متن کاملDeciding Reachability for 3-Dimensional Multi-Linear Systems
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the partition, which governs the dynamical behavior of the system within it. The reachability problem for multi-linear systems has been proven to be decidable for...
متن کامل$\tilde{O}(n^{1/3})$-Space Algorithm for the Grid Graph Reachability Problem
The directed graph reachability problem takes as input an n-vertex directed graph G = (V,E), and two distinguished vertices s and t. The problem is to determine whether there exists a path from s to t in G. This is a canonical complete problem for class NL. Asano et al. proposed an Õ( √ n) space and polynomial time algorithm for the directed grid and planar graph reachability problem. The main ...
متن کاملReachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL ∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL ∩ coUL. Our algorithm decomposes the graphs into biconnected and triconnected components. This gives a tree structure on ...
متن کامل